Building dispatchable networks involving consumable resources within the HSTS framework
نویسندگان
چکیده
Earlier work on scheduling by autonomous systems has demonstrated that schedules in the form of simple temporal networks, with intervals of values for possible event-times, can be made "dispatchable", i.e., executable incrementally in real time with guarantees against failure due to unfortunate event-time selections. These schedules can be built prior to execution by an automated Planner/ Scheduler based on the Heuristic Scheduling Testbed System (HSTS). the present work we show how the property of dispatchabflity can be extended to networks that include constraints for consumable resources. We first describe conditions under which a component of the network composed of resource constraints will support dispatchability. Then we show how a network can be produced during planning that supports dispatchabflity while allowing flexible resource use. This work indicates that flexible handling of consumable resources can be safely extended to the execution layer to provide more effective deployment of these resources.
منابع مشابه
Dispatchable Execution of Schedules Involving Consumable Resources
Earlier work on scheduling by autonomous systems has demonstrated that schedules in the form of simple temporal networks, with intervals of values for possible event-times, can bc maxle "dispatchable~, i.e. executable incrementally in real time with guarantees against failure due to unfortunate cvcnt-time selections. In this work wc show how the property of dispatchabi]ity can be extended to ne...
متن کاملDispatchability Conditions for Schedules with Consumable Resources
Earlier work on scheduling by autonomous systems has demonstrated that schedules in the form of simple temporal networks, with intervals of values for possible event-times, can be made “dispatchable”, i.e., executable incrementally in real time with guarantees against failure due to unfortunate event-time selections. In the present work we show how the property of dispatchability can be extende...
متن کاملA heuristic method for consumable resource allocation in multi-class dynamic PERT networks
This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a n...
متن کاملConstrained consumable resource allocation in alternative stochastic networks via multi-objective decision making
Many real projects complete through the realization of one and only one path of various possible network paths. Here, these networks are called alternative stochastic networks (ASNs). It is supposed that the nodes of considered network are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003